On Equitable Irregular Coloring of Jelly Fish and Coconut Tree Graph
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by χ=(G). It is interesting to note that if a graph G is equitably k-colorable, it does not imply that it is equitab...
متن کاملEquitable Coloring on Total Graph of Bigraphs and Central Graph of Cycles and Paths
1 Department of Mathematics, University College of Engineering Nagercoil, Anna University of Technology Tirunelveli (Nagercoil Campus), Nagercoil 629 004, Tamil Nadu, India 2 Department of Mathematics, R.V.S College of Engineering and Technology, Coimbatore 641 402, Tamil Nadu, India 3 Department of Mathematics, Sri Shakthi Institute of Engineering and Technology, Coimbatore 641 062, Tamil Nadu...
متن کاملGraph-Coloring Register Allocation for Irregular Architectures
The graph-coloring metaphor leads to elegant algorithms for register allocation that have been shown to be quite effective for regular architectures with plenty of registers. Published attempts to make these algorithms applicable to architectures that are irregular in their use of registers have yielded several incompatible extensions that handle only a small subset of the irregularities seen i...
متن کاملZero forcing, tree width, and graph coloring
We show that certain types of zero-forcing sets for a graph give rise to chordal supergraphs and hence to proper colorings. Zero-forcing was originally defined to provide a bound for matrix minimum rank problems [1], but is interesting as a graph-theoretic notion in its own right [5], and has applications to mathematical physics, such as quantum systems [3]. There are different flavors of zero-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1724/1/012024